Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.00 vteřin. 
Reconstruction of Repetitive DNA Segments
Bikár, Robert ; Lexa, Matej (oponent) ; Martínek, Tomáš (vedoucí práce)
The main motivation for master's thesis is to find suitable algorithm that creates a graph representation of NGS sequencing data in linear time. De Bruijn graph was chosen as a method for research. Next, the tool was designed to be able to transform the graph and correct errors created during construction of the graph. The main aim of the thesis is to implement a tool that reconstructs repetitive segments in DNA. Implemented tool was tested and is able to  identify repetitive segments, specify types, visualize them properly and is also able to assemble their sequence with fine accuracy on simpler genomes. When using complex genomes, tool is able to reconstruct only fragments of repetitive segments.
Reconstruction of Repetitive DNA Segments
Bikár, Robert ; Lexa, Matej (oponent) ; Martínek, Tomáš (vedoucí práce)
The main motivation for master's thesis is to find suitable algorithm that creates a graph representation of NGS sequencing data in linear time. De Bruijn graph was chosen as a method for research. Next, the tool was designed to be able to transform the graph and correct errors created during construction of the graph. The main aim of the thesis is to implement a tool that reconstructs repetitive segments in DNA. Implemented tool was tested and is able to  identify repetitive segments, specify types, visualize them properly and is also able to assemble their sequence with fine accuracy on simpler genomes. When using complex genomes, tool is able to reconstruct only fragments of repetitive segments.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.